An enhanced method using NP-complete problem in Public Key Cryptography System
نویسندگان
چکیده
منابع مشابه
A New NP-Complete Problem and Public-Key Identification
The appearance of the theory of zero-knowledge, presented by Goldwasser, Micali and Rackoff in 1985, opened a way to secure identification schemes. The first application was the famous Fiat-Shamir scheme based on the problem of modular square roots extraction. In the following years, many other schemes have been proposed, some Fiat-Shamir extensions but also new discrete logarithm based schemes...
متن کاملAn Algebraic Method for Public-key Cryptography
Algebraic key establishment protocols based on the difficulty of solving equations over algebraic structures are described as a theoretical basis for constructing public–key cryptosystems.
متن کاملSystem Design Is an NP-Complete Problem
The system design process translates the customers’ needs into a buildable system design. It requires selecting subsystems from an allowable set and matching the interfaces between them. Designs that meet the top-level input and output requirements are tested to see how well they meet the system’s performance and cost goals. This paper proves that the System Design Problem is NP-complete by red...
متن کاملAn Applicable Public-Key-Cryptosystem Based on NP-Complete Problems
The proposed PKC has two main advantages that will make it applicable to the real world. The first one is a decoding algorithm with an expected runtime of O(n) elementary operations. The second advantage is that the corresponding matrix A is of the form A = [A′ | I], where I is the identity matrix and A′ being completely random, in contrast to e.g. McEliece-Type systems (cf. [1]), which means t...
متن کاملUsing the Subgroup Membership Search Problem in Public Key Cryptography
There are several public key protocols around that use the computational hardness of either the conjugacy search problem or the word (search) problem for nonabelian groups. In this paper, we describe a cryptosystem whose security is based on the computational hardness of the subgroup membership (search) problem: given a group G, a subgroup H generated by h1, . . . , hk, and an element h ∈ H, fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Institute of Information and Communication Engineering
سال: 2015
ISSN: 2234-4772
DOI: 10.6109/jkiice.2015.19.12.2865